Sub-state tying in tied mixture hidden Markov models
نویسندگان
چکیده
An approach is proposed for partial tying of states of tiedmixture hidden Markov models. To facilitate tying at the substate level, the state emission probabilities are constructed in two stages, or equivalently, are viewed as a ‘‘mixture of mixtures of Gaussians.’’ This paradigm allows, and is complemented with, an optimization technique to seek the best complexity-accuracy tradeoff solution, which jointly exploits Gaussian density sharing and sub-state tying. Experimental results on the E-set show that the classification error rate is reduced by over 20% compared to standard Gaussian sharing and whole-state tying. The approach is then embedded within the recently developed procedure of combined parameter training and reduction technique. Experiments with the overall technique show that the error rate is further reduced by 8%.
منابع مشابه
A Tied-Mixture 2-D HMM Face Recognition System
In this paper, a simplified 2-D second-order Hidden Markov Model (HMM) with tied state mixtures is applied to the face recognition problem. The mixture of the model states is fully-tied across all models for lower complexity. Tying HMM parameters is a well-known solution for the problem of insufficient training data leading to nonrobust estimation. We show that parameter tying in HMM also enhan...
متن کاملSubstate tying with combined parameter training and reduction in tied-mixture HMM design
Two approaches are proposed for the design of tied-mixture hidden Markov models (TMHMM). One approach improves parameter sharing via partial tying of TMHMM states. To facilitate tying at the substate level, the state emission probabilities are constructed in two stages or, equivalently, are viewed as a “mixture of mixtures of Gaussians.” This paradigm allows, and is complemented with, an optimi...
متن کاملA new look at HMM parameter tying for large vocabulary speech recognition
Most current state-of-the-art large-vocabulary continuous speech recognition (LVCSR) systems are based on state-clustered hidden Markov models (HMMs). Typical systems use thousands of state clusters, each represented by a Gaussian mixture model with a few tens of Gaussians. In this paper, we show that models with far more parameter tying, like phonetically tied mixture (PTM) models, give better...
متن کاملParameter tying and gaussian clustering for faster, better, and smaller speech recognition
We present a new view of hidden Markov model (HMM) state tying, showing that the accuracy of phonetically tied mixture (PTM) models is similar to, or better than, that of the more typical stateclustered HMM systems. The PTM models require fewer Gaussian distance computations during recognition, and can lead to recognition speedups. We describe a per-phone Gaussian clustering algorithm that auto...
متن کاملA Comparative Evaluation of GMM-Free State Tying Methods for ASR
Deep neural network (DNN) based speech recognizers have recently replaced Gaussian mixture (GMM) based systems as the state-of-the-art. While some of the modeling techniques developed for the GMM based framework may directly be applied to HMM/DNN systems, others may be inappropriate. One such example is the creation of context-dependent tied states, for which an efficient decision tree state ty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000